Fast Area-Based Stereo Algorithm
نویسنده
چکیده
Area-based stereo algorithms, as the most universal of all stereovision methods, have the potential to become widely used in many industrial sectors, but their relatively low speed halt the usage. This paper describes the method which can significantly increase computing speed. This new method is called false epipolar constraint. It is an addition to epipolar constraint which can reduce the set of possible corresponding points from whole image to single line [3]. False epipolar constraint in combination with epipolar constraint is able to reduce even this set. This method is most efficient in area-based stereo algorithms but it can be used in any application, where the epipolar constraint is used.
منابع مشابه
A fast area-based stereo matching algorithm
This paper presents an area-based stereo algorithm suitable to real time applications. The core of the algorithm relies on the uniqueness constraint and on a matching process that allows for rejecting previous matches as soon as more reliable ones are found. The proposed approach is compared with the left-right consistency constraint, being the latter the basic method for detecting unreliable m...
متن کاملAdaptive search area for fast motion estimation
In this paper a new method for determining the search area for motion estimation algorithm based on block matching is suggested. In the proposed method the search area is adaptively found for each block of a frame. This search area is similar to that of the full search (FS) algorithm but smaller for most blocks of a frame. Therefore, the proposed algorithm is analogous to FS in terms of reg...
متن کاملWindow-based approach for fast stereo correspondence
In this study, the authors present a new area-based stereo matching algorithm that computes dense disparity maps for a real-time vision system. Although many stereo matching algorithms have been proposed in recent years, correlation-based algorithms still have an edge because of speed and less memory requirements. The selection of appropriate shape and size of the matching window is a difficult...
متن کاملA Fast Stereo Matching Method
Stereo matching is important in the area of computer vision and photogrammetry. This paper presents a fast stereo matching algorithm which produces a dense disparity map by using a pyramid structure, fast correlation and dynamic programming techniques. Fast correlation is achieved by using the box filtering technique which is invariant to the size of the correlation window. The disparity for ea...
متن کاملFast Census Transform-based Stereo Algorithm using SSE2
In this paper, we propose a census transform-based fast stereo algorithm. Most conventional fast stereo algorithms are based on SAD (Sum of Absolute Difference) or NC (Normalized Correlation). However, SAD is often sensitive to noise or illumination changes. Image matching by census transform is known to be robust to radiometric distortion, since the differences in gain and bias between two ima...
متن کامل